FNR: Arbitrary Length Small Domain Block Cipher Proposal

نویسندگان

  • Sashank Dara
  • Scott R. Fluhrer
چکیده

We propose a practical flexible (or arbitrary) length small domain block cipher, FNR encryption scheme. FNR denotes Flexible Naor and Reingold. It can cipher small domain data formats like IPv4, Port numbers, MAC Addresses, Credit card numbers, any random short strings while preserving their input length. In addition to the classic Feistel networks, Naor and Reingold propose usage of Pair-wise independent permutation (PwIP) functions based on Galois Field GF(2). Instead we propose usage of random N×N Invertible matrices in GF(2).

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Invertible Universal Hashing and the TET Encryption Mode

This work describes a mode of operation, TET, that turns a regular block cipher into a length-preserving enciphering scheme for messages of (almost) arbitrary length. When using an n-bit block cipher, the resulting scheme can handle input of any bit-length between n and 2 and associated data of arbitrary length. The mode TET is a concrete instantiation of the generic mode of operation that was ...

متن کامل

On the Construction of Variable-Input-Length Ciphers

Whereas a block cipher enciphers messages of some one particular length (the blocklength), a variable-input-length cipher takes messages of varying (and preferably arbitrary) lengths. Still, the length of the ciphertext must equal the length of the plaintext. This paper introduces the problem of constructing such objects, and provides a practical solution. Our VIL mode of operation makes a vari...

متن کامل

EME*: Extending EME to Handle Arbitrary-Length Messages with Associated Data

This work describes a mode of operation, EME∗, that turns a regular block cipher into alength-preserving enciphering scheme for messages of (almost) arbitrary length. Specifically, theresulting scheme can handle any bit-length, not shorter than the block size of the underlyingcipher, and it also handles associated data of arbitrary bit-length. Such a scheme can either beused...

متن کامل

BPS: a Format-Preserving Encryption Proposal

In recent months, attacks on servers of payment processors have led to the disclosure of tens of millions of credit card numbers (also known as Personal Account Numbers, PANs). As an answer, end-to-end encryption has been advocated and an encryption standard that preserves the format of the data would be welcome. More generally, a format-preserving encryption scheme would be welcomed for many r...

متن کامل

Security of Iterated Hash Functions Based on Block Ciphers

Cryptographic hash functions obtained by iterating a round function constructed from a block cipher and for which the hash-code length is twice the block length m of the underlying block cipher are considered. The computational security of such hash functions against two particular attacks, namely, the free-start target and free-start collision attacks, is investigated; these two attacks differ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • IACR Cryptology ePrint Archive

دوره 2014  شماره 

صفحات  -

تاریخ انتشار 2014